Min-Max Approach for High-Speed Train Scheduling and Rescheduling Models

نویسندگان

چکیده

The definition of train scheduling is going to shift its current static approach, as generally resulting in a timetable, towards dynamic approach where the timetable can be modified order enhance satisfaction passengers’ demand. In this paper, demand-oriented and rescheduling models are formalized propose that satisfy groups passengers. More specifically, assessment based on min max method. proposed allows timetables for rail services along multiline network according operational constraints related capacity, speed limits, passenger’s transfers, possible conflict track section use, with main objective minimize travel time set groups. resulted by problem have been used input model predefined disturbances assumed some nodes network. applied real case study high-speed trains Northern Italy.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Heuristic Approach to Train Rescheduling

Starting from the defined network topology and the timetable assigned beforehand, the paper considers a train rescheduling in respond to disturbances that have occurred. Assuming that the train trips are jobs, which require the elements of infrastructure – resources, it was done by the mapping of the initial problem into a special case of job shop scheduling problem. In order to solve the given...

متن کامل

Improved Max-Min Scheduling Algorithm

In this research paper, additional constrains have been considered to progress a holistic analysis based algorithm based on Max-Min algorithm, which work on principle of sorting jobs(cloudlets) based on completion time of cloudlets. The improved algorithms here also reviews the job characteristics in method of size, pattern, payload ratio and available storage blocks in particular cluster of co...

متن کامل

Scheduling Arrivals for Min-max Blocking

Consider a source using a high speed data link to transmit packets to a nite capacity downstream buuer. For bursty sources using high speed links, an entire burst might be transmitted to the downstream buuer before any feedback would be received. Regulating the packet transmission process to minimize packet blocking at the downstream link is formulated as an open loop stochastic scheduling prob...

متن کامل

An Optimized Approach to CPU Scheduling Algorithm: Min-max

CPU scheduling is the basis of multi-programmed operating systems. The scheduler is accountable for multiplexing processes on the CPU. By switching the CPU among processes, the operating system results in the computer more prolific. Various CPU scheduling algorithms exist for a multi-programmed operating system like First Come First Served (FCFS), Shortest Job First (SJF), Shortest Remaining Ti...

متن کامل

Max-Margin Min-Entropy Models

We propose a new family of latent variable models called max-margin min-entropy (m3e) models, which define a distribution over the output and the hidden variables conditioned on the input. Given an input, an m3e model predicts the output with the smallest corresponding Rényi entropy of generalized distribution. This is equivalent to minimizing a score that consists of two terms: (i) the negativ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2021

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2021.3064427